Crossings in Grid Drawings
نویسندگان
چکیده
منابع مشابه
Crossings in Grid Drawings
We prove tight crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of crossing-free geometric graphs that can be drawn on such grids. In particular, we show that any geometric graph with m ≥ 8N edges and with vertices on a 3D integer grid of volumeN , has Ω((m2/n) l...
متن کاملGeometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) 0.380559 (n 4 )+Θ(n3) by means of a new construction based on an iterative duplication strategy starting with a set having a certain structure of halving lines. © 2006 Elsevier Inc. All rights reserved.
متن کاملNon-Shellable Drawings of Kn with Few Crossings
In the early 60s, Harary and Hill conjectured H(n) := 1 4b2 cbn−1 2 cbn−2 2 cbn−3 2 c to be the minimum number of crossings among all drawings of the complete graph Kn. It has recently been shown that this conjecture holds for so-called shellable drawings of Kn. For n ≥ 11 odd, we construct a non-shellable family of drawings of Kn with exactly H(n) crossings. In particular, every edge in our dr...
متن کاملTwo-Layered Genetic Network Drawings with Minimum Edge Crossings
Inference of genetic networks from expression profile data is one of the challenging works in the field of the array informatics. A good visualization tool for the inferred networks would help us to deepen our understandings of the interactions among the genes. Here, we focus on the time series data of expression profiles, and discuss the method to draw a two-layered graph representing the caus...
متن کاملThree-dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any xed r 2, every r-colorable graph of n vertices has a three-dimensional grid drawing that ts into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3025